Online product allocation in poultry batchers with lookahead

نویسندگان

چکیده

• HGA for online product allocation reduces give-away and achieves target throughput. outperforms current practice in terms of giveaway throughput adherence a case study. Incorporating prediction the fitness function improves performance. Poultry processing plants utilize batchers to produce products, aiming minimize operational costs while adhering imposed by their customers. This paper studies production control such batchers, leading an online, time-constrained, bi-objective decision problem. To solve this problem, we introduce genetic algorithm equipped with local search novel cost function. hybrid (HGA) is shown be competitive complete enumeration approaches, other heuristics small-scale experiments. We also conduct numerical analysis that evaluates sensitivity problem setting. Finally, industry study shows significantly costs, nearly eliminates deviations from compared practice.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Online Scheduling with Lookahead: Multipass Assembly Lines

This paper describes our use of competitive analysis and the on-line model of computation in a product development setting; speciically, we use competitive analysis to evaluate on-line scheduling strategies for controlling a new generation of networked reprographic machines (combination printer-copier-fax machines servicing a network) currently being developed by companies such as Xerox Corpora...

متن کامل

Online Packet Scheduling with Bounded Delay and Lookahead

We study the online bounded-delay packet scheduling problem (PacketScheduling), where packets of unit size arrive at a router over time and need to be transmitted over a network link. Each packet has two attributes: a non-negative weight and a deadline for its transmission. The objective is to maximize the total weight of the transmitted packets. This problem has been well studied in the litera...

متن کامل

Online Allocation with Risk Information

We consider the problem of dynamically apportioning resources among a set of options in a worst-case online framework. The model we investigate is a generalization of the well studied online learning model. In particular, we allow the learner to see as additional information how high the risk of each option is. This assumption is natural in many applications like horse-race betting, where gambl...

متن کامل

How much can lookahead help in online single machine scheduling

This paper studies online single machine scheduling where jobs have unit length and the objective is to maximize the number of completed jobs. Lookahead is considered to improve the competitiveness of online deterministic strategies. For preemption-restart model, we will prove a lower bound of ( LD + 2)/( LD + 1) for the case where LD 1 and 3/2 for the case where 0 LD < 1, in which LD is the le...

متن کامل

String matching with lookahead

Forward-SBNDM is a recently introduced variation of the BNDM algorithm for exact string matching. Forward-SBNDM inspects a 2-gram in the text such that the first character is the last one of an alignment window of the pattern and the second one is then outside the window. We present a generalization of this idea by inspecting several lookahead characters beyond an alignment window and integrate...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computers & Industrial Engineering

سال: 2022

ISSN: ['0360-8352', '1879-0550']

DOI: https://doi.org/10.1016/j.cie.2021.107875